Structure-sensitive semantic matching for aggregate question answering over knowledge base

Aggregate question answering essentially returns answers for given questions by obtaining query graphs with unique dependencies between values and corresponding objects. Word order dependency, as the key to uniquely identify dependency of the query graph, reflects the dependencies between the words in the question. However, due to the semantic gap caused by the expression difference between questions encoded with word vectors and query graphs represented with logical formal elements, it is not trivial to match the correct query graph for the question. Most existing approaches design more expressive query graphs for complex questions and rank them just by directly calculating their similarities, ignoring the semantic gap between them. In this paper, we propose a novel Structure-sensitive Semantic Matching(SSM) approach that learns aligned representations of dependencies in questions and query graphs to eliminate their gap. First, we propose a cross-structure matching module to bridge the gap between two modalities(i.e., textual question and query graph). Then, we propose an entropy-based gated AQG filter to remove the structural noise caused by the uncertainty of dependencies. Finally, we present a two-channel query graph representation that fuses the semantics of abstract structure and grounding content of the query graph explicitly. Experimental results show that SSM could learn aligned representations of questions and query graphs to eliminate the gaps between their dependencies, and improves up to 12% (F1 score) on aggregation questions of two benchmark datasets.     

一种基于策略的网络管理结构方案

介绍了基于策略的网络管理的概念和当前的研究状况，在策略定义、冲突检测和系统安全问题等方面进行了讨论，提出了一种适合基于策略的网络管理的结构方案，并分析了该方案的合理性。     

Reliability and scale effect in toughness of concrete structures

In the present work, the distribution of the random toughness characteristics (i.e. critical energy release rate, G_1c) has been evaluated on the basis of experimental observations. Fracture test results from three groups of geometrically similar concrete specimens of size (width×total depth×thickness), 420×420×50–1680×1680×200 mm³, made with different maximum aggregate size of 9.5, 19, 38, and 76 mm were analyzed using a recently proposed distribution of extremes. In applications of probability, it is important to use an appropriate distribution type and adequate techniques for estimating the parameters of distribution. In this study, a new type distribution of minima is employed for probability computations. It was noticed that the entropy of distribution increases with the crack length, i.e. the uncertainty of toughness, G_1c, value increases with crack length. A non-linear reduction of the maximum allowable splitting force with the defect size, a, was noticed. For large specimens, the maximum allowable splitting load is more sensitive to the required reliability level than that for small specimens. Reliability increases with aggregate size when all other conditions were constant.     

A CONSTITUTIVE MODEL FOR ELASTIC-PLASTIC DEFORMATION UNDER CYCLIC MULTIAXIAL STRAINING

Abstract— The yield criterion is interpreted as defining the metric of the stress space. Hydrostatic stresses correspond to null geodesies. The plastic strain increment represents a normal projection of the increment undergone by a certain scalar function (hardening function) which depends only on the distance between stress points. This establishes a flow rule formally equivalent to the Prandtl-Reuss equations. Consideration of un-loading processes leads to the analysis of equivalent paths and to the definition of a generalized length or separation which provides a new representation of kinematic hardening.     

Compile-time copy elimination

Single-assignment and functional languages have value semantics that do not permit side-effects. This lack of side-effects makes automatic detection of parallelism and optimization for data locality in programs much easier. However, the same property poses a challenge in implementing these languages efficiently. This paper describes an optimizing compiler system that solves the key problem of aggregate copy elimination. The methods developed rely exclusively on compile-time algorithms, including interprocedural analysis, that are applied to an intermediate data flow representation. By dividing the problem into update-in-place and build-in-place analysis, a small set of relatively simple techniques—edge substitution, graph pattern matching, substructure sharing and substructure targeting—was found to be very powerful. If combined properly and implemented carefully, the algorithms eliminate unnecessary copy operations to a very high degree. No run-time overhead is imposed on the compiled programs.     

Mutual recognition of the results of measurements and tests and formation of a world-wide metrology system

The main prerequisites are considered in a historical aspect and steps ate taken in creating a world-wide metrology system with the aim of providing conditions for the mutual recognition of measurement results. __________ Translated from Izmeritel’naya Tekhnika, No. 11. pp. 59–62, November, 2007.     

Incremental maintenance of aggregate and outerjoin expressions

Views stored in a data warehouse need to be kept current. As recomputing the views is very expensive, incremental maintenance algorithms are required. Over recent years, several incremental maintenance algorithms have been proposed. None of the proposed algorithms handle the general case of relational expressions involving aggregate and outerjoin operators efficiently.     

Controlling the losing probability in a monotone game

We deal with a complex game between Alice and Bob where each contender’s probability of victory grows monotonically by unknown amounts with the resources employed. For a fixed effort on Alice’s part, Bob increases his resources on the basis of the results for each round (victory, tie or defeat) with the aim of reducing the probability of defeat to below a given threshold. We read this goal in terms of computing a confidence interval for the probability of losing and realize that the moves in some contests may bring in an indeterminacy trap: in certain games Bob cannot simultaneously have both a low probability-of-defeat measure and a narrow confidence interval. We use the inferential mechanism called twisting argument to compute the above interval on the basis of two joint statistics. Careful use of such statistics allows us to avoid indeterminacy.     

多机器人通信中防冲突方法研究

研究多个机器人通信中的冲突问题。针对当有针对当对机器人同时进行通信的时候,一个机器人可能同时接受多个其它机器人发来的指令,在时域指令信号方面形成冲突,造成机器人之间通信成功率不高的问题。为了解决这个问题,提出冲突自调整多机器人通信方法,算法利用新到达指令填充离开指令造成的空闲时隙,解决时域信号冲突。利用捎带检测技术,提前对下个时隙进行调整,进行空闲时间预留,减少空闲时隙的产生。很好地减少空闲时隙,解决由此带来的通信成功率不高的问题。实验结果表明,这种方法在多个机器人同时通信的情况下,能够很好地协调通信关系,避免指令冲突,提高了多机器人的通信成功率。     

多设备防火墙安全策略冲突分析

防火墙是作为网络中最常用的安全屏障以代理技术、包过滤技术、状态检查技术、网络地址转换技术(NAT)、VPN技术等功能,保证了计算机的安全性。Internet防火墙可以有效防止外部用户非法使用内部网的资源,加强网络与网络间的访问控制,从而阻止防火墙所保护的内部网络的私密数据被外人所窃取或更改。